Productivity of Non-Orthogonal Term Rewrite Systems
نویسندگان
چکیده
منابع مشابه
Productivity of Non-Orthogonal Term Rewrite Systems
Productivity is the property that finite prefixes of an infinite constructor term can be computed using a given term rewrite system. Hitherto, productivity has only been considered for orthogonal systems, where non-determinism is not allowed. This paper presents techniques to also prove productivity of non-orthogonal term rewrite systems. For such systems, it is desired that one does not have t...
متن کاملNon-connuent Term-rewrite Systems
The transfer component of a machine translation (MT) system typically comprises three aspects, namely the transfer structure used to transfer source into target structures, the (set of) transfer rules and the transfer process, which interpretes the set of transfer rules to derive the target from the source structure. The transfer structure can be formally considered as a term and the set of tra...
متن کاملOrthogonal Higher-Order Rewrite Systems are Confluent
Two important aspects of computation are reduction, hence the current infatuation with termrewriting systems (TI~Ss), and abstraction, hence the study of A-calculus. In his groundbreaking thesis, Klop [10] combined both areas in the framework of combinatory reduction systems (ClaSs) and lifted many results from the A-calculus to the CRS-level. More recently [15], we proposed a different althoug...
متن کاملBehavioral Rewrite Systems and Behavioral Productivity
This paper introduces behavioral rewrite systems, where rewriting is used to evaluate experiments, and behavioral productivity, which says that each experiment can be fully evaluated, and investigates some of their properties. First, it is shown that, in the case of (infinite) streams, behavioral productivity generalizes and may bring to a more basic rewriting setting the existing notion of str...
متن کاملTransformations of Conditional Term Rewrite Systems
Term rewriting is a well understood and commonly used framework in theoretical computer science for program analysis and program verification. An intuitive extension of term rewrite systems are conditional term rewrite systems. Yet, although they are more natural for certain tasks, they turn out to be more complex to analyze. In order to better understand and implement conditional term rewrite ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2012
ISSN: 2075-2180
DOI: 10.4204/eptcs.82.4